|
| 1: |
|
app(app(and,true),true) |
→ true |
| 2: |
|
app(app(and,true),false) |
→ false |
| 3: |
|
app(app(and,false),true) |
→ false |
| 4: |
|
app(app(and,false),false) |
→ false |
| 5: |
|
app(app(or,true),true) |
→ true |
| 6: |
|
app(app(or,true),false) |
→ true |
| 7: |
|
app(app(or,false),true) |
→ true |
| 8: |
|
app(app(or,false),false) |
→ false |
| 9: |
|
app(app(forall,p),nil) |
→ true |
| 10: |
|
app(app(forall,p),app(app(cons,x),xs)) |
→ app(app(and,app(p,x)),app(app(forall,p),xs)) |
| 11: |
|
app(app(forsome,p),nil) |
→ false |
| 12: |
|
app(app(forsome,p),app(app(cons,x),xs)) |
→ app(app(or,app(p,x)),app(app(forsome,p),xs)) |
|
There are 8 dependency pairs:
|
| 13: |
|
APP(app(forall,p),app(app(cons,x),xs)) |
→ APP(app(and,app(p,x)),app(app(forall,p),xs)) |
| 14: |
|
APP(app(forall,p),app(app(cons,x),xs)) |
→ APP(and,app(p,x)) |
| 15: |
|
APP(app(forall,p),app(app(cons,x),xs)) |
→ APP(p,x) |
| 16: |
|
APP(app(forall,p),app(app(cons,x),xs)) |
→ APP(app(forall,p),xs) |
| 17: |
|
APP(app(forsome,p),app(app(cons,x),xs)) |
→ APP(app(or,app(p,x)),app(app(forsome,p),xs)) |
| 18: |
|
APP(app(forsome,p),app(app(cons,x),xs)) |
→ APP(or,app(p,x)) |
| 19: |
|
APP(app(forsome,p),app(app(cons,x),xs)) |
→ APP(p,x) |
| 20: |
|
APP(app(forsome,p),app(app(cons,x),xs)) |
→ APP(app(forsome,p),xs) |
|
The approximated dependency graph contains one SCC:
{13,15-17,19,20}.